证明了：1）图G和H的强乘积图GH的控制数γ（GH）≤γ（G）γ（H）,并举例说明此上界是可以达到的;2）若γ（H）=1,则G与H的字典乘积图的控制数γ（Gο ......

讨论了比无爪图更广泛的图——拟无爪图，得到了以下两个结果：（i）若图G是拟无爪图，且满足ω（G—S）≤t（G），则2t（G）=κ（G）．（ii）若图G是拟无爪图，对于任意......

Let G = (V, E) be a simple graph. A set S í V is a dominating set of G, if every vertex in V-S is adjacent to at le......

For any graph G, the Inj-equitable graph of a graph G, denoted by IE (G) , is the graph with the same vertices as G and ......